Review on the Bat Algorithm and Various Metaheuristic Techniques for Efficient Parallel Scheduling
نویسنده
چکیده
The various meta-heuristic techniques for cloud and grid environment are: Ant Colony Optimization (ACO), Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Tabu Search, Firefly Algorithm, BAT Algorithm and many more. So this paper represents the two types of meta-heuristic techniques, i.e. BAT algorithm and Genetic Algorithm. The different types of methods which comprise meta-heuristic algorithms range from simple local search approach to complex learning methods. It also shows the comparison of various techniques, i.e. one of the BAT intelligence (BI) and Genetic algorithm (GA) are used to figure out single objective multiprocessor scheduling problem utilizing objective functions as makespan, tardiness and power consumption. BI depicts significant improvement in terms of solution quality when compared with GA in terms of contradictory between makespan and energy furthermore among tardiness and energy. Keywords— Bat Algorithm, Constant Absolute Target Direction (CATD) Technique, Metaheuristics, Dynamic Voltage Scaling, Energy-Aware Multiprocessor Scheduling, Energy Utilization, Normalized Weight Additive Utility Function (NWAUF)
منابع مشابه
A New Hybrid Meta-Heuristics Approach to Solve the Parallel Machine Scheduling Problem Considering Human Resiliency Engineering
This paper proposes a mixed integer programming model to solve a non-identical parallel machine (NIPM) scheduling with sequence-dependent set-up times and human resiliency engineering. The presented mathematical model is formulated to consider human factors including Learning, Teamwork and Awareness. Moreover, processing time of jobs are assumed to be non-deterministic and dependent to their st...
متن کاملThree Hybrid Metaheuristic Algorithms for Stochastic Flexible Flow Shop Scheduling Problem with Preventive Maintenance and Budget Constraint
Stochastic flexible flow shop scheduling problem (SFFSSP) is one the main focus of researchers due to the complexity arises from inherent uncertainties and also the difficulty of solving such NP-hard problems. Conventionally, in such problems each machine’s job process time may encounter uncertainty due to their relevant random behaviour. In order to examine such problems more realistically, fi...
متن کاملNew Formulation and Solution in PCB Assembly Systems with Parallel Batch processors
This paper considers the scheduling problem of parallel batch processing machines with non-identical job size and processing time. In this paper, a new mathematical model with ready time and batch size constraints is presented to formulate the problem mathematically, in which simultaneous reduction of the makespan and earliness-tardiness is the objective function. In recent years, the nature-in...
متن کاملM K Marichelvam and T Prabaharan: a Bat Algorithm for Realistic Hybrid Flowshop Scheduling Problems to Minimize Makespan and Mean Flow Time
This paper addresses the multistage hybrid flow shop (HFS) scheduling problems. The HFS is the special case of flowshop problem. Multiple parallel machines are considered in each stage in the HFS. The HFS scheduling problem is known to be strongly NPhard. Hence, many researchers proposed metaheuristic algorithms for solving the HFS scheduling problems. This paper develops a bat algorithm (BA) t...
متن کاملAn Improved Bat Algorithm with Grey Wolf Optimizer for Solving Continuous Optimization Problems
Metaheuristic algorithms are used to solve NP-hard optimization problems. These algorithms have two main components, i.e. exploration and exploitation, and try to strike a balance between exploration and exploitation to achieve the best possible near-optimal solution. The bat algorithm is one of the metaheuristic algorithms with poor exploration and exploitation. In this paper, exploration and ...
متن کامل